Bitangential interpolation problems for symmetric rational matrix functions
نویسندگان
چکیده
منابع مشابه
Recursiveness in Matrix Rational Interpolation Problems 1 2
We consider the problem of computing solutions to a variety of matrix rational interpolation problems. These include the partial realization problem for matrix power series and Newton-Pad e, Hermite-Pad e, Simultaneous Pad e, M-Pad e and multipoint Pad e approximation problems along with their matrix generalizations. A general recurrence relation is given for solving these problems. Unlike othe...
متن کاملBitangential Interpolation in Generalized Schur Classes
Bitangential interpolation problems in the class of matrix valued functions in the generalized Schur class are considered in both the open unit disc and the open right half plane, including problems in which the solutions is not assumed to be holomorphic at the interpolation points. Linear fractional representations of the set of solutions to these problems are presented for invertible and sing...
متن کاملMatrix Rational Interpolation with Poles as Interpolation Points
In this paper, we show the equivalence between matrix rational interpolation problems with poles as interpolation points and no-pole problems. This equivalence provides an effective method for computing matrix rational interpolants having poles as interpolation points. However, this equivalence is only valid in those cases where enough pole information is known. It is an open problem on how one...
متن کاملTriangular C Interpolation by Rational Functions
Two general local C triangular interpolation schemes by rational functions from C data are proposed for any nonnegative integer m. The schemes can have either 2m + 1 order algebraic precision if the required data are given on vertices and edges, or m + E[m/2] + 1 or m + 1 order algebraic precision if the data are given only at vertices. The orders of the interpolation error are estimated. Examp...
متن کاملSparse interpolation of multivariate rational functions
Consider the black box interpolation of a τ -sparse, n-variate rational function f , where τ is the maximum number of terms in either numerator or denominator. When numerator and denominator are at most of degree d, then the number of possible terms in f is O(dn) and explodes exponentially as the number of variables increases. The complexity of our sparse rational interpolation algorithm does n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1996
ISSN: 0024-3795
DOI: 10.1016/0024-3795(95)00562-5